J an 2 00 3 Explicit , analytical solution of scaling quantum graphs

نویسندگان

  • Yu. Dabaghian
  • R. Blümel
چکیده

Based on earlier work on regular quantum graphs we show that a large class of scaling quantum graphs with arbitrary topology are explicitly analytically solvable. This is surprising since quantum graphs are excellent models of quantum chaos and quantum chaotic systems are not usually explicitly analytically solvable.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ua nt - p h / 03 01 00 3 v 1 3 J an 2 00 3 Explicit , analytical solution of scaling quantum graphs

Based on earlier work on regular quantum graphs we show that a large class of scaling quantum graphs with arbitrary topology are explicitly analytically solvable. This is surprising since quantum graphs are excellent models of quantum chaos and quantum chaotic systems are not usually explicitly analytically solvable.

متن کامل

Explicit analytical solution for scaling quantum graphs.

We show that scaling quantum graphs with arbitrary topology are explicitly analytically solvable. This is surprising since quantum graphs are excellent models of quantum chaos and quantum chaotic systems are not usually explicitly analytically solvable.

متن کامل

Explicit spectral formulas for scaling quantum graphs.

We present an exact analytical solution of the spectral problem of quasi-one-dimensional scaling quantum graphs. Strongly stochastic in the classical limit, these systems are frequently employed as models of quantum chaos. We show that despite their classical stochasticity all scaling quantum graphs are explicitly solvable in the form E(n) =f (n) , where n is the sequence number of the energy l...

متن کامل

A ug 2 00 1 One - dimensional quantum chaos : Explicitly solvable cases

We present quantum graphs with remarkably regular spectral characteristics. We call them regular quantum graphs. Although regular quantum graphs are strongly chaotic in the classical limit, their quantum spectra are explicitly solvable in terms of periodic orbits. We present analytical solutions for the spectrum of regular quantum graphs in the form of explicit and exact periodic orbit expansio...

متن کامل

ua nt - p h / 03 02 03 5 v 1 4 F eb 2 00 3 Solution of scaling quantum networks

We show that all scaling quantum graphs are explicitly integrable, i.e. any one of their spectral eigenvalues En is computable analytically, explicitly, and individually for any given n. This is surprising, since quantum graphs are excellent models of quantum chaos [see, e.g., T. Kottos and H. Schanz, Physica E 9, 523 (2001)]. 05.45.Mt Typeset using REVTEX 1 Graphs are networks of bonds and ver...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003